SYLLABUS – MCS 494: Probability on Graphs
نویسنده
چکیده
OFFICE HOURS: 1-2 MWF. TEXT: None. I will try to point out the sections of some relevant books, which will address the corresponding material we cover. Some of these books are listed below in bibliography. PREREQUISITE: Math 310 (first course in Linear Algebra), and Stat 401 (Introduction to Probability) or equivalent courses. Basic knowledge of graphs is welcome, (some parts of MCS 261), but not necessary. GRADING: 1. Every student will be assigned to write a draft of the lecture notes for 2 to 3 lectures of the course. 2. Homework assignments: a. Some theoretical problems. b. Some simulation programs. Outline of the course topics
منابع مشابه
روش وزنی تصادفی شبیهسازی مونتکارلو برای تحلیل قابلیت اطمینان سازهها
The computational burdens and more accurate approximations for the estimation of the failure probability are the main concerns in the structural reliability analyses. The Monte Carlo simulation (MCS) method can simply provide an accurate estimation for the failure probability, but it is a time-consuming method for complex reliability engineering problems with a low failure probability and may e...
متن کاملOn parameterized complexity of the Multi-MCS problem
We introduce the maximum common subgraph problem for multiple graphs (Multi-MCS) inspired by various biological applications such as multiple alignments of gene sequences, protein structures, metabolic pathways, or protein–protein interaction networks. MultiMCS is a generalization of the two-graph Maximum Common Subgraph problem (MCS). On the basis of the framework of parameterized complexity t...
متن کاملAn Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs
We propose a new fast algorithm for solving the Maximum Common Subgraph (MCS) problem. MCS is an NP-complete problem. In this paper, we focus on a special class of graphs, i.e. Planar Triangulation Graphs, which are commonly used in computer vision, pattern recognition and graphics. By exploiting the properties of Planar Triangulation Graphs and restricting the problem to connected MCS, for two...
متن کاملMaximum Common Subelement Metrics and its Applications to Graphs
In this paper we characterize a mathematical model called Maximum Common Subelement (MCS) Model and prove the existence of four different metrics on such model. We generalize metrics on graphs previously proposed in the literature and identify new ones by showing three different examples of MCS Models on graphs based on (1) subgraphs, (2) induced subgraphs and (3) an extended notion of subgraph...
متن کاملMaximum Cardinality Search for Computing Minimal Triangulations
We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: Lex-M and MCS. Lex-M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that also computes a minimal triangulation of an arbitrary graph. MCS simplified the fundamental c...
متن کامل